The minimal normal $\mu$-complete filter on $P\sb \kappa\lambda$
نویسندگان
چکیده
منابع مشابه
Is Mu a Normal Rhythm?
Although it was first described more than 50 years ago, the physiological significance and the potential pathological features of the mu rhythm still remains unclear. In an attempt to clarify certain aspects of this activity, we studied the presence of mu rhythm in 100 healthy subjects with no family history of neurological disease. A 15 minute long resting EEG register was obtained from each s...
متن کاملSound and Complete Typing for lambda-mu
In this paper we define intersection and union type assignment for Parigot's calculus λµ. We show that this notion is complete (i.e. closed under subject-expansion), and show also that it is sound (i.e. closed under subject-reduction). This implies that this notion of intersection-union type assignment is suitable to define a semantics.
متن کاملProbabilistic Mu-Calculus: Decidability and Complete Axiomatization
We introduce a version of the probabilistic μ-calculus (PMC) built on top of a probabilistic modal logic that allows encoding n-ary inequational conditions on transition probabilities. PMC extends previously studied calculi and we prove that, despite its expressiveness, it enjoys a series of good metaproperties. Firstly, we prove the decidability of satisfiability checking by establishing the s...
متن کاملMinimal r-Complete Partitions
A minimal r-complete partition of an integer m is a partition of m with as few parts as possible, such that all the numbers 1, . . . , rm can be written as a sum of parts taken from the partition, each part being used at most r times. This is a generalization of M-partitions (minimal 1-complete partitions). The number of M-partitions of m was recently connected to the binary partition function ...
متن کاملOn the possible volume of $mu$-$(v,k,t)$ trades
A $mu$-way $(v,k,t)$ $trade$ of volume $m$ consists of $mu$ disjoint collections $T_1$, $T_2, dots T_{mu}$, each of $m$ blocks, such that for every $t$-subset of $v$-set $V$ the number of blocks containing this t-subset is the same in each $T_i (1leq i leq mu)$. In other words any pair of collections ${T_i,T_j}$, $1leq i< j leq mu$ is a $(v,k,t)$ trade of volume $m$. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1995
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1995-1234632-6